A semantic constraint on binary determiners

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A semantic constraint on binary determiners

A type 〈1, 1〉 quantifier F is symmetric iff F (X, X)(Y ) = F (Y, Y )(X). It is shown that quantifiers denoted by irreducible binary determiners in natural languages are both conservative and symmetric and not only

متن کامل

On Binary Constraint Networks

It is well-known that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain of interest, and edges labelled with binary relations between the values, which constrain the choice of sol...

متن کامل

Semantic Constraint and QoS-Aware Large-Scale Web Service Composition

Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...

متن کامل

On Combinations of Binary Qualitative Constraint Calculi

Qualitative constraint calculi are representation formalisms that allow for efficient reasoning about spatial and temporal information. Many of the calculi discussed in the field of Qualitative Spatial and Temporal Reasoning can be defined as combinations of other, simpler and more compact formalisms. On the other hand, existing calculi can be combined to a new formalism in which one can repres...

متن کامل

A non-binary constraint ordering heuristic for constraint satisfaction problems

Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables and values should to be considered. Choosing the right order of variables and values can noticeably improve the efficiency of constraint satisfaction. Furthermore, the order in which constraints are studied can improve efficie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linguistics and Philosophy

سال: 2009

ISSN: 0165-0157,1573-0549

DOI: 10.1007/s10988-009-9053-6